New Examples of Complete Sets, with Connections to a Diophantine Theorem of Furstenberg
نویسنده
چکیده
A set A ⊆ N is called complete if every sufficiently large integer can be written as the sum of distinct elements of A. In this paper we present a new method for proving the completeness of a set, improving results of Cassels (’60), Zannier (’92), Burr, Erdős, Graham, and Li (’96), and Hegyvári (’00). We also introduce the somewhat philosophically related notion of a dispersing set and refine a theorem of Furstenberg (’67).
منابع مشابه
Ramsey Properties of Subsets of N Solvability of Linear Diophantine Systems within Wm Sets 16
With my appreciation, I wish to thank my advisor Prof. Hillel Furstenberg for his guidance, support and encouragement during these unforgettable years of learning and research Abstract We associate ergodic properties to some subsets of the natural numbers. For any given family of subsets of the natural numbers one may study the question of occurrence of certain " algebraic patterns " in every s...
متن کاملConstruction of measures of noncompactness of $C^k(Omega)$ and $C^k_0$ and their application to functional integral-differential equations
In this paper, first, we investigate the construction of compact sets of $ C^k$ and $ C_0^k$ by proving ``$C^k, C_0^k-version$" of Arzel`{a}-Ascoli theorem, and then introduce new measures of noncompactness on these spaces. Finally, as an application, we study the existence of entire solutions for a class of the functional integral-differential equations by using Darbo's fixe...
متن کاملSeveral new results based on the study of distance measures of intuitionistic fuzzy sets
It is doubtless that intuitionistic fuzzy set (IFS) theory plays an increasingly important role in solving the problems under uncertain situation. As one of the most critical members in the theory, distance measure is widely used in many aspects. Nevertheless, it is a pity that part of the existing distance measures has some drawbacks in practical significance and accuracy. To make up for their...
متن کاملSelf-similar fractals and arithmetic dynamics
The concept of self-similarity on subsets of algebraic varieties is defined by considering algebraic endomorphisms of the variety as `similarity' maps. Self-similar fractals are subsets of algebraic varieties which can be written as a finite and disjoint union of `similar' copies. Fractals provide a framework in which, one can unite some results and conjectures in Diophantine g...
متن کاملMultiple Recurrence and Finding Patterns in Dense Sets
Szemerédi’s Theorem asserts that any positive-density subset of the integers must contain arbitrarily long arithmetic progressions. It is one of the central results of additive combinatorics. After Szemeredi’s original combinatorial proof, Furstenberg noticed the equivalence of this result to a new phenomenon in ergodic theory that he called ‘multiple recurrence’. Furstenberg then developed som...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015